#define _CRT_SECURE_NO_WARNINGS 1
#include"Tree.h"
#include "Queue.h"
void TreeTest()
{
	//
	BTNode* n1 = BuyNode(1);
	BTNode* n2 = BuyNode(2);
	BTNode* n3 = BuyNode(3);
	BTNode* n4 = BuyNode(4);
	BTNode* n5 = BuyNode(5);
	BTNode* n6 = BuyNode(6);
	n1->left = n2;
	n1->right = n3;
	n2->left = n4;
	n2->right = n5;
	n3->left = n6;
	/*printf("%p ", BinaryTreeFind(n1, 3));*/
	bool index = BinaryTreeComplete(n1);
	printf("%d\n", index);
	LevelOrder(n1);
	BinaryTreeDestory(&n1);
}
void QueueTest()
{
	Queue q;
	QueueInit(&q);
	/*QueuePush(&q, 1);
	QueuePush(&q, 2);
	QueuePush(&q, 3);*/
	/*while (!QueueEmpty(&q))
	{
		printf("%d ", QueueFront(&q));
		QueuePop(&q);
	}*/
	QueueFront(&q);
	QueueDestroy(&q);
}

int main()
{
	//QueueTest();
	TreeTest();
	return 0;
}
